#include <bits/stdc++.h>
using namespace std;

void solve(){
	    int n;
        cin >> n;
        vector<int> a(n);
        
        for(int i=0;i<n;i++){
        	cin>>a[i];
		}
		
        int sx = abs(a[0]);
        
        vector<int> s;
        for (int i = 1; i < n; ++i) s.push_back(abs(a[i]));
        
        sort(s.begin(), s.end());
        int cnt = upper_bound(s.begin(), s.end(), sx) - s.begin();
        
        int k = (n + 1) / 2;
        bool f1, f2;
        if (a[0] > 0) {
            f1 = cnt <= k - 1;
            f2 = cnt <= n - k;
        } else {
            f1 = cnt <= n - k;
            f2 = cnt <= k - 1;
        }
        cout << (f1 || f2 ? "YES" : "NO");
} 

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
        cout<<endl;
    }
    return 0;
}
